#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

// 高精度乘法 ac

string add(string a, string b) {
    int m = a.size(), n = b.size();
    reverse(a.begin(), a.end());
    reverse(b.begin(), b.end());
    string ans;
    int jin = 0, num = 0;
    int i;
    for (i = 0; i < m && i < n; i++) {
        num = jin + a[i] - '0' + b[i] - '0';
        jin = num / 10;
        num %= 10;
        ans.push_back(num + '0');
    }
    if (i == m) {
        while (i < n) {
            num = jin + b[i] - '0';
            jin = num / 10;
            num %= 10;
            ans.push_back(num + '0');
            i++;
        }
    } else {
        while (i < m) {
            num = jin + a[i] - '0';
            jin = num / 10;
            num %= 10;
            ans.push_back(num + '0');
            i++;
        }
    }
    if (jin) ans.push_back('1');
    reverse(ans.begin(), ans.end());
    return ans;
}

string mul(string a, char& b){
    if(b == '0') return "0";
    int jin = 0,num, m = a.size();
    reverse(a.begin(),a.end());
    string ans;
    for(int i=0;i<m;i++){
        num = jin + (a[i]-'0') * (b-'0');
        jin = num / 10;
        num %= 10;
        ans.push_back(num+'0');
    }
    if(jin) ans.push_back(jin + '0');
    reverse(ans.begin(), ans.end());
    return ans;
}

string solve(string s, string t) {

    int n = t.size();
    reverse(t.begin(), t.end());
    string ans = "";
    string tmp = "";
    for(int i=0;i<n;i++){
        tmp = mul(s, t[i]);
        for(int j=0;j<i;j++) tmp.push_back('0');
        ans = add(ans, tmp);
    }
    return ans;
}


int main() {
    string a = "733064366";
    string b = "459309139";
    cout << solve(a, b) << endl;


    return 0;
}

// "733064366","459309139"
// "336703162779040874"
// "308234486393659004"